FLCD: A Flexible Low Complexity Design of Coded Distributed Computing
نویسندگان
چکیده
We propose a flexible low complexity design (FLCD) of coded distributed computing (CDC) with empirical evaluation on Amazon Elastic Compute Cloud (Amazon EC2). CDC can expedite MapReduce like computation by trading increased map computations to reduce communication load and shuffle time. A main novelty FLCD is utilize the freedom in defining functions develop asymptotic homogeneous systems support varying intermediate values (IV) sizes under general framework. Compared existing designs constant IV sizes, offers greater flexibility adapting network parameters significantly reduces implementation requiring fewer input files groups. The scheme first proposed low-complexity that operate an arbitrary number nodes load. perform evaluations executing TeraSort algorithm EC2 cluster. This time theoretical predictions are validated evaluations. demonstrate 2.0 4.24× speedup compared conventional uncoded MapReduce, 12 52 percent reduction total time, wider range operating schemes.
منابع مشابه
A New Combinatorial Design of Coded Distributed Computing
Coded distributed computing introduced by Li et al. in 2015 is an efficient approach to trade computing power to reduce the communication load in general distributed computing frameworks such as MapReduce. In particular, Li et al. show that increasing the computation load in the Map phase by a factor of r can create coded multicasting opportunities to reduce the communication load in the Reduce...
متن کاملLow-Cost Flexible Software Fault Tolerance for Distributed Computing
In this paper, we revisit the problem of software fault tolerance in distributed systems. In particular, we propose an extension of a message-driven confidence-driven (MDCD) protocol we have developed for error containment and recovery in a particular type of distributed embedded system. More specifically, we augment the original MDCD protocol by introducing the method of “finegrained confidenc...
متن کاملCoded Computing for Distributed Graph Analytics
Many distributed graph computing systems have been developed recently for efficient processing of massive graphs. These systems require many messages to be exchanged among computing machines at each step of the computation, making communication bandwidth a major performance bottleneck. We present a coded computing framework that systematically injects redundancy in the computation phase to enab...
متن کاملLow Complexity, Flexible LDPC Decoders
The design and implementation of a flexible LDPC decoder able to cope with different codes, is gathering an increasing interest in the scientific community. Roughly speaking, a flexible decoder exhibits the remarkable ability of being able to decode different codes resorting to the same hardware. In this paper we present a novel decoder architecture specifically devised to present an high flexi...
متن کاملSupport for flexible and transparent distributed computing
Modern distributed computing developed from the traditional supercomputing community rooted firmly in the culture of batch management. Therefore, the field has been dominated by queuing-based resource managers and work flow based job submission environments where static resource demands needed be determined and reserved prior to launching executions. This has made it difficult to support resour...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Cloud Computing
سال: 2023
ISSN: ['2168-7161', '2372-0018']
DOI: https://doi.org/10.1109/tcc.2021.3098593